Elliptic Grid Control on a Discrete Level
نویسندگان
چکیده
Considering a grid cell with a single central point the solution of the discretized Laplace equation may be conceived as a weighted average of points on the cell boundary. Our grid control method is based on a local perturbation of the numerical solution to the Laplace equation by specifying line-wise central target points relative to the orientation of and the distance from the cell’s bounding faces. Simple one-dimensional weighting functions allow to extend the overall control of grid line spacing and direction from the boundaries into the field.
منابع مشابه
The new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملAdaptation of Structured Grid for Supersonic and Transonic Flows
Two distinct redistribution grids - adaptation techniques, spring analogy and elliptic grid generator are applied to two-dimensional steady, inviscid, shocked flows, and the ability of each technique is examined and compared. Euler equations are solved base on Roe's Reimann solver approach to simulate supersonic flow around a sphere, transonic flow about an airfoil and supersonic flow in a symm...
متن کاملGeneralized Jacobian and Discrete Logarithm Problem on Elliptic Curves
Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کامل